Concatenated Codes Based on Multidimensional Parity-check Codes and Turbo Codes
نویسندگان
چکیده
Turbo-codes provide communications near capacity when very large interleavers (and thus codeword lengths) are used. However, many military communication systems require packet lengths that are too short to exploit the full capability of these codes. We have previously shown that a rectangular parity-check code can be used as an outer code with a turbo code as an inner code in a serial concatenated coding scheme, and that this configuration significantly lowers the error floor and improves performance for packets of only a few thousand bits [1]. In this research, we show that for short packets, the performance can be further improved by replacing the rectangular parity-check code by a multidimensional parity-check code [2] that operates at a higher rate and has a higher minimum distance than the rectangular parity-check code. The new codes makes it possible to achieve very low error probabilities with even simple turbo codes and without the use of complicated interleaving schemes.
منابع مشابه
Reduced-complexity decoding for concatenated codes based on rectangular parity-check codes and turbo codes
In this paper, we compare the performance of several different decoding strategies for concatenated codes based on a serial concatenation of a rectangular parity-check code (RPCC) with a turbo code. These concatenated codes are referred to as RPCC+turbo codes. RPCC+turbo codes have been shown to significantly outperform turbo codes in several scenarios [1],[2]. One particularly useful applicati...
متن کاملAn approach to fault detection and correction in design of systems using of Turbo codes
We present an approach to design of fault tolerant computing systems. In this paper, a technique is employed that enable the combination of several codes, in order to obtain flexibility in the design of error correcting codes. Code combining techniques are very effective, which one of these codes are turbo codes. The Algorithm-based fault tolerance techniques that to detect errors rely on the c...
متن کاملNear Shannon Limit Performance of Low Density Parity Check Codes
We report the empirical performance of Gallager’s low density parity check codes on Gaussian channels. We show that performance substantially better than that of standard convolutional and concatenated codes can be achieved; indeed the performance is almost as close to the Shannon limit as that of Turbo codes. A linear code may be described in terms of a generator matrix G or in terms of a pari...
متن کاملNear Shannon Limit Performance of Low Density Parity Check Codes Construction 1a. an M by N Matrix (m Rows, N Columns) Is Created at Random with Weight
We report the empirical performance of Gallager's low density parity check codes on Gaus-sian channels. We show that performance substantially better than that of standard convolu-tional and concatenated codes can be achieved; indeed the performance is almost as close to the Shannon limit as that of Turbo codes. A linear code may be described in terms of a generator matrix G or in terms of a pa...
متن کاملConcatenated codes for fading channels based on recursive space-time trellis codes
We propose a class of codes which combine the principles of turbo coding and space–time trellis codes. It is first shown that several classes of space–time codes have an equivalent recursive realization. This fact is then exploited to design serial concatenated coding schemes with an outer code, interleaver, and an inner recursive space–time encoder. Two solutions are proposed in this paper—The...
متن کامل